Applying Gödel's Dialectica Interpretation to Obtain a Constructive Proof of Higman's Lemma
نویسندگان
چکیده
منابع مشابه
Applying Gödel's Dialectica Interpretation to Obtain a Constructive Proof of Higman's Lemma
We use Gödel's Dialectica interpretation to analyse Nash-Williams' elegant but non-constructive 'minimal bad sequence' proof of Higman's Lemma. The result is a concise constructive proof of the lemma (for arbitrary decidable well-quasi-orders) in which Nash-Williams' combinatorial idea is clearly present, along with an explicit program for finding an embedded pair in sequences of words.
متن کاملA simple proof of Zariski's Lemma
Our aim in this very short note is to show that the proof of the following well-known fundamental lemma of Zariski follows from an argument similar to the proof of the fact that the rational field $mathbb{Q}$ is not a finitely generated $mathbb{Z}$-algebra.
متن کاملConstructive Proof of Lovász Local Lemma
Let A be a finite collection of mutually independent “bad” events (ones we wish to avoid) in a probability space Ω. The probability of none of these events happening is exactly ∏ A∈A(1−Pr [A]). In particular, this probability is positive whenever no event in A has probability 1. What if the events in A are not mutually independent but has limited dependence? Let Γ(A) ⊆ A be the subset of events...
متن کاملFuzzy Linear Programming and its Application for a Constructive Proof of a Fuzzy Version of Farkas Lemma
The main aim of this paper is to deal with a fuzzy version of Farkas lemma involving trapezoidal fuzzy numbers. In turns to that the fuzzy linear programming and duality theory on these problems can be used to provide a constructive proof for Farkas lemma. Keywords Farkas Lemma, Fuzzy Linear Programming, Duality, Ranking Functions.
متن کاملA nonstandard proof of a lemma from constructive measure theory
The conceptual gulf between constructive analysis (in the sense of Bishop [1]) and nonstandard analysis (in the sense of Robinson [7]) is vast, despite the historical genesis of both methodologies from foundational considerations. Those who use nonstandard arguments often say of their proofs that they are “constructive modulo an ultrafilter”; implicit in this statement is the suggestion that su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2012
ISSN: 2075-2180
DOI: 10.4204/eptcs.97.4